0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n010.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 15:49:51 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.37	% Number of cores: 8
0.15/0.37	% Python version: Python 3.6.8
0.15/0.37	# Version: 2.6rc1-ho
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 59 seconds
0.22/0.46	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.22/0.46	# and selection function SelectMaxLComplexAvoidPosPred.
0.22/0.46	#
0.22/0.46	# Preprocessing time       : 0.073 s
0.22/0.46	
0.22/0.46	# Proof found!
0.22/0.46	# SZS status Theorem
0.22/0.46	# SZS output start CNFRefutation
0.22/0.46	thf(conj_0, conjecture, ?[X58:list_char > int, X59:list_char > int]:(((relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ X58 @ X59&bval @ b @ X58)&big_big_step @ (produc1193801173ar_int @ c2 @ X59) @ t_a)&big_big_step @ (produc1193801173ar_int @ c @ X58) @ ta), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.22/0.46	thf(fact_4_Suc_Oprems_I7_J, axiom, relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ sa @ s_a, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_Suc_Oprems_I7_J)).
0.22/0.46	thf(fact_2_Suc_Oprems_I3_J, axiom, big_big_step @ (produc1193801173ar_int @ c @ sa) @ ta, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_Suc_Oprems_I3_J)).
0.22/0.46	thf(fact_3_Suc_Oprems_I4_J, axiom, big_big_step @ (produc1193801173ar_int @ c2 @ s_a) @ t_a, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_Suc_Oprems_I4_J)).
0.22/0.46	thf(fact_0_Suc_Oprems_I6_J, axiom, bval @ b @ sa, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_Suc_Oprems_I6_J)).
0.22/0.46	thf(c_0_5, negated_conjecture, ~(?[X58:list_char > int, X59:list_char > int]:(((relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ X58 @ X59&bval @ b @ X58)&big_big_step @ (produc1193801173ar_int @ c2 @ X59) @ t_a)&big_big_step @ (produc1193801173ar_int @ c @ X58) @ ta)), inference(assume_negation,[status(cth)],[conj_0])).
0.22/0.46	thf(c_0_6, negated_conjecture, ![X1387:list_char > int, X1388:list_char > int]:(~relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ X1387 @ X1388|~bval @ b @ X1387|~big_big_step @ (produc1193801173ar_int @ c2 @ X1388) @ t_a|~big_big_step @ (produc1193801173ar_int @ c @ X1387) @ ta), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.22/0.46	thf(c_0_7, negated_conjecture, ![X23:list_char > int, X22:list_char > int]:(~relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ X22 @ X23|~bval @ b @ X22|~big_big_step @ (produc1193801173ar_int @ c2 @ X23) @ t_a|~big_big_step @ (produc1193801173ar_int @ c @ X22) @ ta), inference(split_conjunct,[status(thm)],[c_0_6])).
0.22/0.46	thf(c_0_8, plain, relati23543761ar_int @ p @ b @ c @ (suc @ ka) @ sa @ s_a, inference(split_conjunct,[status(thm)],[fact_4_Suc_Oprems_I7_J])).
0.22/0.46	thf(c_0_9, plain, big_big_step @ (produc1193801173ar_int @ c @ sa) @ ta, inference(split_conjunct,[status(thm)],[fact_2_Suc_Oprems_I3_J])).
0.22/0.46	thf(c_0_10, plain, big_big_step @ (produc1193801173ar_int @ c2 @ s_a) @ t_a, inference(split_conjunct,[status(thm)],[fact_3_Suc_Oprems_I4_J])).
0.22/0.46	thf(c_0_11, plain, bval @ b @ sa, inference(split_conjunct,[status(thm)],[fact_0_Suc_Oprems_I6_J])).
0.22/0.46	thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10]), c_0_11])]), ['proof']).
0.22/0.46	# SZS output end CNFRefutation
0.22/0.46	# Proof object total steps             : 13
0.22/0.46	# Proof object clause steps            : 6
0.22/0.46	# Proof object formula steps           : 7
0.22/0.46	# Proof object conjectures             : 5
0.22/0.46	# Proof object clause conjectures      : 2
0.22/0.46	# Proof object formula conjectures     : 3
0.22/0.46	# Proof object initial clauses used    : 5
0.22/0.46	# Proof object initial formulas used   : 5
0.22/0.46	# Proof object generating inferences   : 1
0.22/0.46	# Proof object simplifying inferences  : 4
0.22/0.46	# Training examples: 0 positive, 0 negative
0.22/0.46	# Parsed axioms                        : 330
0.22/0.46	# Removed by relevancy pruning/SinE    : 0
0.22/0.46	# Initial clauses                      : 608
0.22/0.46	# Removed in clause preprocessing      : 137
0.22/0.46	# Initial clauses in saturation        : 471
0.22/0.46	# Processed clauses                    : 55
0.22/0.46	# ...of these trivial                  : 4
0.22/0.46	# ...subsumed                          : 5
0.22/0.46	# ...remaining for further processing  : 46
0.22/0.46	# Other redundant clauses eliminated   : 2
0.22/0.46	# Clauses deleted for lack of memory   : 0
0.22/0.46	# Backward-subsumed                    : 0
0.22/0.46	# Backward-rewritten                   : 0
0.22/0.46	# Generated clauses                    : 63
0.22/0.46	# ...of the previous two non-trivial   : 17
0.22/0.46	# Contextual simplify-reflections      : 0
0.22/0.46	# Paramodulations                      : 10
0.22/0.46	# Factorizations                       : 0
0.22/0.46	# NegExts                              : 0
0.22/0.46	# Equation resolutions                 : 3
0.22/0.46	# Propositional unsat checks           : 0
0.22/0.46	#    Propositional check models        : 0
0.22/0.46	#    Propositional check unsatisfiable : 0
0.22/0.46	#    Propositional clauses             : 0
0.22/0.46	#    Propositional clauses after purity: 0
0.22/0.46	#    Propositional unsat core size     : 0
0.22/0.46	#    Propositional preprocessing time  : 0.000
0.22/0.46	#    Propositional encoding time       : 0.000
0.22/0.46	#    Propositional solver time         : 0.000
0.22/0.46	#    Success case prop preproc time    : 0.000
0.22/0.46	#    Success case prop encoding time   : 0.000
0.22/0.46	#    Success case prop solver time     : 0.000
0.22/0.46	# Current number of processed clauses  : 46
0.22/0.46	#    Positive orientable unit clauses  : 20
0.22/0.46	#    Positive unorientable unit clauses: 0
0.22/0.46	#    Negative unit clauses             : 13
0.22/0.46	#    Non-unit-clauses                  : 13
0.22/0.46	# Current number of unprocessed clauses: 419
0.22/0.46	# ...number of literals in the above   : 1208
0.22/0.46	# Current number of archived formulas  : 0
0.22/0.46	# Current number of archived clauses   : 0
0.22/0.46	# Clause-clause subsumption calls (NU) : 34
0.22/0.46	# Rec. Clause-clause subsumption calls : 9
0.22/0.46	# Non-unit clause-clause subsumptions  : 0
0.22/0.46	# Unit Clause-clause subsumption calls : 64
0.22/0.46	# Rewrite failures with RHS unbound    : 0
0.22/0.46	# BW rewrite match attempts            : 1
0.22/0.46	# BW rewrite match successes           : 0
0.22/0.46	# Condensation attempts                : 0
0.22/0.46	# Condensation successes               : 0
0.22/0.46	# Termbank termtop insertions          : 40461
0.22/0.46	
0.22/0.46	# -------------------------------------------------
0.22/0.46	# User time                : 0.083 s
0.22/0.46	# System time              : 0.008 s
0.22/0.46	# Total time               : 0.091 s
0.22/0.46	# Maximum resident set size: 2360 pages
0.22/0.46	EOF